Algorithms and Theory of Computation Handbook, Second Edition CRC PRESS Boca Raton Ann Arbor

Source URL: www.mcs.vuw.ac.nz

Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

First-Order Logic for the Analysis of Programs on Weak Memory Models Alexei Lisitsa Department of Computer Science University of Liverpool, Liverpool, UK

Source URL: www.ai4fm.org

• Model checking
• First-order logic
• Mathematical logic
• Logic in computer science
• Formal methods
• Theory of computation

Actor Model of Computation: Scalable Robust Information Systems Carl Hewitt This article is dedicated to Alonzo Church and Dana Scott. The Actor Model is a mathematical theory that treats “Actors” as the universal pr

Source URL: arxiv.org

The Gradualizer: A Methodology and Algorithm for Generating Gradual Type Systems Matteo Cimini Jeremy G. Siek

Source URL: dl.dropboxusercontent.com

• Type theory
• Lambda calculus
• Type systems
• Models of computation
• Program analysis
• Simply typed lambda calculus
• Gradual typing
• Monad
• System F

Honors Theory of Computation Problem Set 2 Solutions Problem 1 Solution: (a) Suppose that L1 = {0n 1m 0n } is regular. Let p be the pumping length given by the pumping

Source URL: ftp.cs.nyu.edu

CSCI-UA: Theory of Computation Problem Set 4 All problems are worth 10 points. Collaboration is allowed, but you must write your own solutions. Write the names of your collaborators (and your own!). Unless state

Source URL: ftp.cs.nyu.edu

Byzantine Fault Isolation in the Farsite Distributed File System Howdy. My name’s John Douceur. I’m with Microsoft Research, and this talk is about some work of Jon Howell’s and mine, developing the technique of By

Source URL: iptps06.cs.ucsb.edu

• Computing
• Engineering
• Systems science
• Systems engineering
• Fault-tolerant computer systems
• Byzantine fault tolerance
• Failure
• Fault tolerance
• Theory of computation
• Distributed computing
• Standard Performance Evaluation Corporation
• File system

CSCI-UA: Theory of Computation Problem Set 1 For this problem set, the alphabet is Σ = {0, 1} unless otherwise specified. All problems are worth 10 points. Collaboration is allowed, but you must write your own

Source URL: ftp.cs.nyu.edu

Property Testing: A Learning Theory Perspective Dana Ron∗ School of EE Tel-Aviv University Ramat Aviv, Israel

Source URL: www.eng.tau.ac.il

• Machine learning
• Computational complexity theory
• Theoretical computer science
• Applied mathematics
• Learning
• Models of computation
• Property testing
• Decision tree model
• Sample complexity
• PP
• Probability distribution
• Time complexity